Optimal Reserve Price for the Generalized Second-price Auction in Sponsored Search Advertising

نویسندگان

  • Baichun Xiao
  • Jun Li
چکیده

In sponsored search advertising advertisers bid ad links pertaining to a keyword from search engines. This paper presents a pricing model for sponsored search advertising in a dynamic framework. It focuses on the generalized second-price auction, which is widely used by major search engines including Google and Yahoo!. Unlike the assertion in the literature that the number of advertisers and the number of ad links have no impact on the selection of reserve price, our result is noticeably different. We show that the optimal reserve price is affected by both factors. In particular, under a set of mild conditions, the optimal reserve price is equal to the expected value of some order statistic of advertiser’s per-click values. Simulations based on the continuous-time bidding process confirm our theoretical findings.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two Pricing Mechanisms in Sponsored Search Advertising

Sponsored search advertising has grown rapidly since the last decade and is now a significant revenue source for search engines. To ameliorate revenues, search engines often set fixed or variable reserve price to in influence advertisers’ bidding. This paper studies and compares two pricing mechanisms: the generalized second-price auction (GSP) where the winner at the last ad position pays the ...

متن کامل

Optimal Auction Design in a Multi-unit Environment: The Case of Sponsored Search Auctions

We characterize the optimal (revenue maximizing) auction for sponsored search advertising. We show that a search engine’s optimal reserve price is independent of the number of bidders. Using simulations, we consider the changes that result from a search engine’s choice of reserve price and from changes in the number of participating advertisers.

متن کامل

Simplified mechanisms with an application to sponsored-search auctions

Simplified Mechanisms with an Application to Sponsored-Search Auctions Paul Milgrom First draft: August 16, 2007 This draft: December 17, 2008 A mechanism can be simplified by restricting its message space. If the restricted message spaces satisfy a certain “outcome closure property,” then the simplification is “tight”: for every , any Nash equilibrium of the simplified mechanism is also an Nas...

متن کامل

Mechanism Design for Sponsored Search Auctions

The sponsored search auction problem was introduced briefly as an example in Chapter 1. In this chapter, we study this problem in more detail to illustrate a compelling application of mechanism design. We first describe a framework to model this problem as a mechanism design problem under a reasonable set of assumptions. Using this framework, we describe three well known mechanisms for sponsore...

متن کامل

Revenue Guarantees in Sponsored Search Auctions

Sponsored search auctions are the main source of revenue for search engines. In such an auction, a set of utility-maximizing advertisers compete for a set of ad slots. The assignment of advertisers to slots depends on bids they submit; these bids may be different than the true valuations of the advertisers for the slots. Variants of the celebrated VCG auction mechanism guarantee that advertiser...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009